Simple expressions for the long walk distance
نویسندگان
چکیده
The walk distances in graphs are defined as the result of appropriate transformations of the ∑∞ k=0(tA) k proximity measures, where A is the weighted adjacency matrix of a connected weighted graph and t is a sufficiently small positive parameter. The walk distances are graph-geodetic, moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter t approaches its limiting values. In this paper, simple expressions for the long walk distance are obtained. They involve the generalized inverse, minors, and inverses of submatrices of the symmetric irreducible singular M-matrix L = ρI −A, where ρ is the Perron root of A.
منابع مشابه
On the first passage time of a simple random walk on a tree
We consider a simple random walk on a tree. Exact expressions are obtained for the expectation and the variance of the first passage time, thereby recovering the known result that these are integers. A relationship of the mean first passage matrix with the distance matrix is established and used to derive a formula for the inverse of the mean first passage matrix.
متن کاملRandom Walk Integrals
We study the expected distance of a two-dimensional walk in the plane with unit steps in random directions. A series evaluation and recursions are obtained making it possible to explicitly formulate this distance for small number of steps. Closed form expressions for all the moments of a 2-step and a 3-step walk are given, and a formula is conjectured for the 4-step walk. Heavy use is made of t...
متن کاملLong Memory in Stock Returns: A Study of Emerging Markets
The present study aimed at investigating the existence of long memory properties in ten emerging stock markets across the globe. When return series exhibit long memory, it indicates that observed returns are not independent over time. If returns are not independent, past returns can help predict future returns, thereby violating the market efficiency hypothesis. It poses a serious challenge to ...
متن کاملThe walk distances in graphs
The walk distances in graphs are defined as the result of appropriate transformations of the ∑∞ k=0(tA) k proximity measures, where A is the weighted adjacency matrix of a graph and t is a sufficiently small positive parameter. The walk distances are graphgeodetic; moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter t approaches its lim...
متن کاملAssociation between six-minute walk distance and long-term outcomes in patients with pulmonary arterial hypertension: Data from the randomized SERAPHIN trial
BACKGROUND Patients with pulmonary arterial hypertension who achieve a six-minute walk distance of 380-440 m may have improved prognosis. Using the randomized controlled trial of macitentan in pulmonary arterial hypertension (SERAPHIN), the association between six-minute walk distance and long-term outcomes was explored. METHODS Patients with six-minute walk distance data at Month 6 were dich...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1112.0088 شماره
صفحات -
تاریخ انتشار 2011